A robust collision source method for rank adaptive dynamical low-rankapproximation in radiation therapy
نویسندگان
چکیده
Deterministic models for radiation transport describe the density of particles moving through a background material. In therapy applications, phase space this is composed energy, spatial position and direction flight. The resulting six-dimensional prohibits fine numerical discretizations, which are essential construction accurate reliable treatment plans. work, we tackle high dimensional dynamical low-rank approximation particle density. Dynamical (DLRA) evolves solution on manifold in time. Interpreting energy variable as pseudo-time lets us employ DLRA framework to represent equation every energy. Stiff scattering terms treated an efficient implicit discretization rank adaptive integrator chosen dynamically adapt To facilitate use boundary conditions reduce overall rank, split into collided uncollided collision source method. Uncollided described by directed quadrature set guaranteeing low computational costs, whereas represented solution. It can be shown that presented method L 2 -stable under time step restriction does not depend stiff terms. Moreover, require inversions matrices. Numerical results configurations well line benchmark underline efficiency proposed
منابع مشابه
A Riemannian rank-adaptive method for low-rank optimization
This paper presents an algorithm that solves optimization problems on a matrix manifold M ⊆ Rm×n with an additional rank inequality constraint. The algorithm resorts to well-known Riemannian optimization schemes on fixed-rank manifolds, combined with new mechanisms to increase or decrease the rank. The convergence of the algorithm is analyzed and a weighted low-rank approximation problem is use...
متن کاملDynamical low-rank approximation
In low-rank approximation, separation of variables is used to reduce the amount of data in computations with high-dimensional functions. Such techniques have proved their value, e.g., in quantum mechanics and recommendation algorithms. It is also possible to fold a low-dimensional grid into a high-dimensional object, and use low-rank techniques to compress the data. Here, we consider low-rank t...
متن کاملDynamical Low-Rank Approximation
For the low rank approximation of time-dependent data matrices and of solutions to matrix differential equations, an increment-based computational approach is proposed and analyzed. In this method, the derivative is projected onto the tangent space of the manifold of rank-r matrices at the current approximation. With an appropriate decomposition of rank-r matrices and their tangent matrices, th...
متن کاملAdaptive and robust radiation therapy optimization for lung cancer
Adaptive and robust radiation therapy optimization for lung cancer Velibor V. Mišić Master of Applied Science Graduate Department of Mechanical and Industrial Engineering University of Toronto 2012 A previous approach to robust intensity-modulated radiation therapy (IMRT) treatment planning for moving tumours in the lung involves solving a single planning problem before treatment and using the ...
متن کاملBeyond Low Rank: A Data-Adaptive Tensor Completion Method
Low rank tensor representation underpins much of recent progress in tensor completion. In real applications, however, this approach is confronted with two challenging problems, namely (1) tensor rank determination; (2) handling real tensor data which only approximately fulfils the low-rank requirement. To address these two issues, we develop a data-adaptive tensor completion model which explici...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ESAIM
سال: 2022
ISSN: ['1270-900X']
DOI: https://doi.org/10.1051/m2an/2022090